Probabilistic Choice Operators as Constraint Combinators: Application to the Statistical Structural Testing Problem

نویسندگان

  • Matthieu Petit
  • Arnaud Gotlieb
چکیده

Probabilistic Concurrent Constraint Programming (PCCP) extends concurrent constraint languages by providing probabilistic choice operators. These operators have proved to be useful in implementing randomized algorithms as well as stochastic processes. In this report, we present an instance of PCCP where probabilistic choice operators are modelled with constraint combinators. This modeling allow us to deal with a new kind of problems where the probabilistic choice is only partially known. An implementation under the form of a library of SICStus Prolog is in progress. The major practical application of our work is the statistical structural testing problem in software testing. Key-words: Probabilistic Concurrent Constraint Programming, Probabilistic Choices Combinator, Statistical Structural Testing ∗ This work is part of the GENETTA project granted by the Brittany region. in ria -0 01 56 04 9, v er si on 3 25 J un 2 00 7 Des Opérateurs de Choix Probabilistes comme des Combinateurs de Contraintes : Application au Problème du Test Statistique Structurel Résumé : La Programmation Concurrente par Contraintes Probabilistes (PCCP) étend la Programmation Concurrente par Contraintes par des opérateurs de choix probabilistes. Ces opérateurs ont prouvé leur utilit dans l’implantation d’algorithmes “randomisés” ainsi que dans la modélisation de processus stochastiques. Dans ce rapport, nous présentons une instance de PCCP dans laquelle les opérateurs de choix probabilististes sont modélisés comme un combinateurs de contraintes. Cette modélisation permet de traiter de nouveaux problèmes pour lesquels le choix probabiliste n’est que partiellement connu. Une implantation sous la forme d’une librairie de SICStus Prolog est présentée. La majeure application de notre travail est le test statistique structurelle. Mots-clés : Programmation Concurrente par Contraintes Probabilistes, Combinateur de choix probabilistes, Test Statistique Structurel in ria -0 01 56 04 9, v er si on 3 25 J un 2 00 7 Prob. Choice Op. as Constraint Combinators: application to the SST problem 3

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic Choice Operators as Global Constraints: Application to Statistical Software Testing

Probabilistic Concurrent Constraint Programming (PCCP) [3] is an extension of Concurrent Constraint Programming (CCP) [5] where probabilistic choice operators are introduced to represent the randomness or uncertain behaviour of processes. A probabilistic choice between two processes can be though of as flipping a coin : head the first process is triggered, tail it is the second. Based on this t...

متن کامل

Persian Handwritten Digit Recognition Using Particle Swarm Probabilistic Neural Network

Handwritten digit recognition can be categorized as a classification problem. Probabilistic Neural Network (PNN) is one of the most effective and useful classifiers, which works based on Bayesian rule. In this paper, in order to recognize Persian (Farsi) handwritten digit recognition, a combination of intelligent clustering method and PNN has been utilized. Hoda database, which includes 80000 P...

متن کامل

A mathematical model for sustainable probabilistic network design problem with construction scheduling considering social and environmental issues

Recent facility location allocation problems are engaged with social, environmental and many other aspects, besides cost objectives.Obtaining a sustainable solution for such problems requires development of new mathematical modeling and optimization algorithms. In this paper, an uncapacitated dynamic facility location-network design problem with random budget constraints is considered. Social i...

متن کامل

Constraint-Based Combinators for Local Search

One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates that traditional combinators from constraint programming have natural counterparts for local search, although their underlying computational model is radically different. In particular, the paper shows that constraint combinator...

متن کامل

Multi-item inventory model with probabilistic demand function under permissible delay in payment and fuzzy-stochastic budget constraint: A signomial geometric programming method

This study proposes a new multi-item inventory model with hybrid cost parameters under a fuzzy-stochastic constraint and permissible delay in payment. The price and marketing expenditure dependent stochastic demand and the demand dependent the unit production cost are considered. Shortages are allowed and partially backordered. The main objective of this paper is to determine selling price, mar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008